Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons
نویسنده
چکیده
One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family of non-colliding motion planning problems for planar robot arms (open or closed polygonal chains). They induce canonical roadmaps in configuration spaces of simple planar polygons with
منابع مشابه
Skeletal Rigidity of Phylogenetic Trees
Motivated by geometric origami and the straight skeleton construction, we outline a map between spaces of phylogenetic trees and spaces of planar polygons. The limitations of this map is studied through explicit examples, culminating in proving a structural rigidity result. 1. Motivation There has been tremendous interest recently in mathematical biology, namely in the field of phylogenetics. T...
متن کاملConfiguration spaces of convex and embedded polygons in the plane
A celebrated result of Connelly, Demaine, and Rote [6] states that any polygon in the plane can be “convexified.” That is, the polygon can be deformed in a continuous manner until it becomes convex, all the while preserving the lengths of the sides and without allowing the sides to intersect one another. In the language of topology, their argument shows that the configuration space of embedded ...
متن کاملThe bridge test for sampling narrow passages with probabilistic roadmap planners
Probabilistic roadmap (PRM) planners have been successful in path planning of robots with many degrees of freedom, but narrow passages in a robot’s configuration space create significant difficulty for PRM planners. This paper presents a hybrid sampling strategy in the PRM framework for finding paths through narrow passages. A key ingredient of the new strategy is the bridge test, which boosts ...
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کامل